4 research outputs found

    APPLYING INTELLIGENT TECHNIQUES FOR TALENT RECRUITMENT

    Get PDF
    The objective of this research is to describe a system to aligned the hard and soft skills of the applicant to the current labor market. For this, a system was implemented which uses Web Scraping to get a general profile of an area, meanwhile for the evaluation of the applicant soft skills is used a Test Cleaver and for the hard skills fuzzy inference system is implemented. Therefore, the data is entered into an Analytic Hierarchy Process, with this, the applier is able to see which area is better to improve according to the hard and soft skills

    Desarrollo de un dispositivo electrónico para el diagnóstico del Síndrome de Apnea Obstructiva del Sueño

    Get PDF
    El presente proyecto consiste en el desarrollo de un dispositivo electrónico portable, fácil de utilizar y de bajo costo para el diagnóstico del Síndrome de Apnea Obstructiva del Sueño (SAOS), a partir del Microcontrolador MCU ATMEGA 2560, e integrados electrónicos como amplificadores operacionales. Con el cual es posible que partiendo de los datos obtenidos por el dispositivo especializado durante la noche de sueño se pueda diagnosticar la presencia de SAOS

    A Multi-Branch-and-Bound Binary Parallel Algorithm to Solve the Knapsack Problem 0–1 in a Multicore Cluster

    No full text
    This paper presents a process that is based on sets of parts, where elements are fixed and removed to form different binary branch-and-bound (BB) trees, which in turn are used to build a parallel algorithm called “multi-BB”. These sequential and parallel algorithms calculate the exact solution for the 0–1 knapsack problem. The sequential algorithm solves the instances published by other researchers (and the proposals by Pisinger) to solve the not-so-complex (uncorrelated) class and some problems of the medium-complex (weakly correlated) class. The parallel algorithm solves the problems that cannot be solved with the sequential algorithm of the weakly correlated class in a cluster of multicore processors. The multi-branch-and-bound algorithms obtained parallel efficiencies of approximately 75%, but in some cases, it was possible to obtain a superlinear speedup
    corecore